/*
自己选择的路 ,跪着也要走完。朋友们 , 虽然这个世界日益浮躁起来,只
要能够为了当时纯粹的梦想和感动坚持努力下去 , 不管其它人怎么样,我
们也能够保持自己的本色走下去。
To the world , you will be a person , but to a person , you
will be the world .                               ——AKPower
*/
//作者:AKPower
//算法:
#include <iostream>
#include <cmath>
#include <algorithm>
#include <cstring>
#include <vector>
#include <map>
#include <queue>
#include <cstdio>
#include <string>
#include <stack>
#include <set>
#define IOS ios::sync_with_stdio(false), cin.tie(0)
using namespace std;
typedef long long ll;
const ll maxn = 1e5 + 100;
ll a[maxn], cn[maxn];
ll n;
void dfs(ll id, ll dep)
{
    if (id > n)
        return;
    cn[dep] += a[id];
    dfs(id * 2, dep + 1);
    dfs(id * 2 + 1, dep + 1);
    return;
}

int main()
{
    IOS;
    cin >> n;
    for (ll i = 1; i <= n; i++)
    {
        cin >> a[i];
    }
    dfs(1, 1);
    ll maxx = -1, maxid = 1;
    for (ll i = 1; i <= n; i++)
    {
        if (maxx < cn[i])
        {
            maxx = cn[i];
            maxid = i;
        }
    }
    cout << maxid << endl;
    getchar();
    getchar();
    return 0;
}
